Quantum walks on regular graphs with realizations in a system of anyons
نویسندگان
چکیده
We build interacting Fock spaces from association schemes and set up quantum walks on the resulting regular graphs (distance-regular distance-transitive). The construction is valid for growing space well defined asymptotically graph. To realize in terms of anyons we switch to dual view identify corresponding modular tensor categories Bose–Mesner algebra. Informally, fusion ring induced by scheme a topological twist can be basis developing category thus system anyons. Finally, demonstrate framework case Grover walk distance-regular graph anyon systems considered. In perspective gather new meaning collisions graphs.
منابع مشابه
Quantum Walks on Regular Graphs and Eigenvalues
We study the transition matrix of a quantum walk on strongly regular graphs. It is proposed by Emms, Hancock, Severini and Wilson in 2006, that the spectrum of S+(U3), a matrix based on the amplitudes of walks in the quantum walk, distinguishes strongly regular graphs. We find the eigenvalues of S+(U) and S+(U2) for regular graphs and show that S+(U2) = S+(U)2 + I.
متن کاملQuantum walks with non-Abelian anyons.
We study the single particle dynamics of a mobile non-Abelian anyon hopping around many pinned anyons on a surface, by modeling it with a discrete time quantum walk. During the evolution, the spatial degree of freedom of the mobile anyon becomes entangled with the fusion degrees of freedom of the collective system. Each quantum trajectory makes a closed braid on the world lines of the particles...
متن کاملSimulating Diffusion with Quantum Walks on Graphs
The path integral method has been an effective approach to solve the Fokker-Planck equation that simulates the evolution of probability distributions in diffusion processes. Yet the major challenges include the memory requirement to store the transition matrix in a fine-grained state space and a small time step required for the accurate estimation of short-time transition probabilities. Previou...
متن کاملRandom Walks on Regular and Irregular Graphs
For an undirected graph and an optimal cyclic list of all its vertices, the cyclic cover time is the expected time it takes a simple random walk to travel from vertex to vertex along the list, until it completes a full cycle. The main result of this paper is a characterization of the cyclic cover time in terms of simple and easy to compute graph properties. Namely, for any connected graph, the ...
متن کاملQuantum Walks on Cayley Graphs
We address the problem of the construction of quantum walks on Cayley graphs. Our main motivation is the relationship between quantum algorithms and quantum walks. In particular, we discuss the choice of the dimension of the local Hilbert space and consider various classes of graphs on which the structure of quantum walks may differ. We completely characterise quantum walks on free groups and p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information Processing
سال: 2022
ISSN: ['1573-1332', '1570-0755']
DOI: https://doi.org/10.1007/s11128-022-03522-9